Regular languages for contracting geodesics
نویسندگان
چکیده
Let G $G$ be a finitely generated group. We show that for any finite symmetric generating set A $A$ , the language consisting of all geodesics in Cay ( ) $(G,A)$ with contracting property is regular language. An immediate consequence existence an infinite geodesic Cayley graph group implies element. In particular, torsion groups cannot contain geodesic. As application, this containing must either virtually Z $\mathbb {Z}$ or acylindrically hyperbolic.
منابع مشابه
TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملFunctional Encryption for Regular Languages
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M . A ciphertext CT encrypts a message m and is associated with an arbitrary length string w. A user is able to decrypt the ciphertext CT if and only if the DFA M associated with his private key accepts the string w. Com...
متن کاملSynchronized Shuue and Regular Languages Synchronized Shuue and Regular Languages
New representation results for three families of regular languages are stated, using a special kind of shuue operation, namely the synchronized shuue. First, it is proved that the family of regular star languages is the smallest family containing the language (a + bc) and closed under synchronized shuue and length preserving morphism. The second representation result states that the family of "...
متن کاملRegular patterns, regular languages and context-free languages
In this paper we consider two questions. First we consider whether every pattern language which is regular can be generated by a regular pattern. We show that this is indeed the case for extended (erasing) pattern languages if alphabet size is at least four. In all other cases, we show that there are patterns generating a regular language which cannot be generated by a regular pattern. Next we ...
متن کاملCo-Regular Languages and Uni cation of Co-Regular Languages
The main goal of this work is the investigation of some properties of co-regular languages. In many applications it is important to handle innnite sets of terms. We represent two equivalent formalisms for nite deened innnite sets of term substitutions which are leading to co-regular languages. As it will be proved later the co-regular languages are monoidic homomorphical images of regular langu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of The London Mathematical Society
سال: 2022
ISSN: ['1469-2120', '0024-6093']
DOI: https://doi.org/10.1112/blms.12608